Improvements for Free
نویسندگان
چکیده
منابع مشابه
Improvements for Free
“Theorems for Free!” (Wadler 1989) is a slogan for a technique that allows to derive statements about functions just from their types. So far, the statements considered have always had a purely extensional flavor: statements relating the value semantics of program expressions, but not statements relating their runtime (or other) cost. Here we study an extension of the technique that allows prec...
متن کاملImprovements of two preconditioned AOR iterative methods for Z-matrices
In this paper, we propose two preconditioned AOR iterative methods to solve systems of linear equations whose coefficient matrices are Z-matrix. These methods can be considered as improvements of two previously presented ones in the literature. Finally some numerical experiments are given to show the effectiveness of the proposed preconditioners.
متن کاملHealth Improvements for a Healthy Shanghai Rising; Comment on “Shanghai Rising: Health Improvements as Measured by Avoidable Mortality since 2000”
The commentator suggests that it is necessary to extend the classical connotation of global city which focuses much on the functions of controlling global capital and production. Global city should also include the dimensions of the leading role and capacity on health improvements and well-being promotion. The commentator agrees with authors’ assessments about Shanghai’s substantial progress o...
متن کاملImprovements for Color Dithering
This paper discusses possible extensions of error-diffusion dithering algorithms for color devices that give a more accurate reproduction of colors than previous algorithms. The main difference of the method presented here and others is that usually color channels are regarded separately, whereas we look at them together as one color value that is used to select the closest output color. This a...
متن کاملElastic Localization: Improvements on Distributed, Range Free Localization for Wireless Sensor Networks
Numerous wireless sensor network algorithms assume that individual sensors possess location information. However, state of the art localization algorithms often achieve acceptable performance only under restrictive assumptions. For instance, some algorithms necessitate regular sensor deployment or centralized computations. Other algorithms require a high proportion of position aware nodes or th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.57.7